package stu.day33_day38.day38;

public class hw1 {
    public boolean isPowerOfTwo(int n) {

        return (n&(n-1))==0?true:false;
    }
    public int hammingDistance(int x, int y) {
        int num = x^y;
        int index = 0;
        while (num != 0) {
            num = num&(num-1);
        }
        return index;

    }
}
